Search results for "Path vector protocol"
showing 7 items of 7 documents
A Probabilistic Approach to the Count-To-Infinity Problem in Distance-Vector Routing Algorithms
2013
Count-to-infinity problem is characteristic for routing algorithms based on the distributed implementation of the classical Bellman-Ford algorithm. In this paper a probabilistic solution to this problem is proposed. It is argued that by the use of a Bloom Filter added to the routing message the routing loops will with high probability not form. An experimental analysis of this solution for use in Wireless Sensor Networks in practice is also included.
A multi-parametric evolution strategies algorithm for vehicle routing problems
2007
Vehicle routing problems are at the heart of most decision support systems for real-life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e. fleet of vehicles) located at one or several points (e.g. depots, warehouses) in order to efficiently service a number of demand or supply points. In this paper an efficient evolution strategies algorithm is developed for both capacitated vehicle routing problem and for vehicle routing problem with time window constraints. The algorithm is based on a new multi-parametric mutation procedure that is applied within the 1 + 1 evolution strategies algorithm. Computational …
ECAR: an Energy/Channel Aware Routing Protocol For Cooperative Wireless Sensor Networks
2011
International audience; The proliferation of low power networks like Wireless Sensor Networks (WSN) rose up new challenges. Power conservation and channel quality become the most important parameters. Obviously, hop count based routing protocols are no more adapted to such networks having power limitations and channel problems. Several alternatives were suggested to cope with these constraints. In MAC layer for example, cooperative protocols were designed to enhance the channel use: the neighbor nodes help the source to retransmit its packets. However, if the path proposed by the routing protocol contains poor channels, the cooperative communications will not save all the packets. Therefore…
Distributed routing and channel allocation in multi-channel multi-hop ad hoc networks
2013
In this paper, we propose a novel routing protocol which is integrated with channel assignment for multi-channel multi-hop wireless ad hoc networks. In such a network, each node is equipped with three transceivers. One is always tuned on a control channel which is responsible for control and broadcast messages, and the other two perform as transmitter and receiver respectively for traffic flows on different data channels. The routing protocol works in an on-demand manner, and the proposed routing discovery process selects a path that potentially traverses nodes with lighter traffic load and lower number of carried flows. With a given number of non-overlapping channels, the optimal solution …
A combined relay-selection and routing protocol for cooperative wireless sensor networks
2012
International audience; In wireless sensor networks several constraints decrease communications performances. In fact, channel randomness and energy restrictions make classical routing protocols inefficient. Therefore, the design of new routing protocols that cope with these constraints become mandatory. The main objective of this paper is to present a multi-objective routing algorithm RBCR that computes routing path based on the energy consumption and channel qualities. Additionally, the channel qualities are evaluated based on the presence of relay nodes. Compared to AODV and AODV associated to a cooperative MAC protocol, RBCR provides better performances in term of delivery ratio, power …
Distance Constrained Mapping to Support NoC Platforms Based on Source Routing
2010
Efficient NoC is crucial for communication among processing elements in a highly parallel processing systems on chip. Mapping cores to slots in a NoC platform and designing efficient routing algorithms are two key problems in NoC design. Source routing offers major advantages over distributed routing especially for regular topology NoC platforms. But it suffers from a serious drawback of overhead since it requires whole communication path to be stored in every packet header. In this paper, we present a core mapping technique which helps to achieve a mapping with the constraint over the path length. We have found that the path length constraint of just 50% is sufficient in most cases. We als…
A Network Protocol to Enhance Robustness in Tree-Based WSNs Using Data Aggregation
2007
This paper proposes a data gathering strategy for wireless sensor networks and an implementation based on the IEEE 802.15.4 standard. The algorithm combines the benefits of single-path and multi-path routing strategies in a hybrid solution which makes use of alternative paths when necessary. We adopt a caching and retransmission technique, which exploits some peculiar features of data aggregation, with the use of implicit acknowledgments of reception. The paper also discusses simulation results that show how the mentioned techniques, combined with exploitation of the features of the IEEE 802.15.4 standard have been used to obtain an efficient protocol that takes energy consumption into acco…